- computable convergence
- мат.вычислимая сходимость
English-Russian scientific dictionary. 2008.
computable convergence
Смотреть что такое "computable convergence" в других словарях:
Computable number — In mathematics, particularly theoretical computer science and mathematical logic, the computable numbers, also known as the recursive numbers or the computable reals, are the real numbers that can be computed to within any desired precision by a… … Wikipedia
Modulus of convergence — In real analysis, a branch of mathematics, a modulus of convergence is a function that tells how quickly a convergent sequence converges. These moduli are often employed in the study of computable analysis and constructive mathematics. If a… … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
General equilibrium — theory is a branch of theoretical microeconomics. It seeks to explain the behavior of supply, demand and prices in a whole economy with several or many markets. It is often assumed that agents are price takers and in that setting two common… … Wikipedia
Constructivism (mathematics) — In the philosophy of mathematics, constructivism asserts that it is necessary to find (or construct ) a mathematical object to prove that it exists. When one assumes that an object does not exist and derives a contradiction from that assumption,… … Wikipedia
Computation in the limit — In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit and limit recursive are also used. One can think of limit computable functions as … Wikipedia
Marcus Hutter — (born 1967) is a German computer scientist and professor at the Australian National University. Hutter was born and educated in Munich, where he studied physics and computer science. In 2000 he joined Jürgen Schmidhuber s group at the Swiss… … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment … Wikipedia
Multiverse — For other uses, see Multiverse (disambiguation). Physical cosmology … Wikipedia
